Strong Approximation via Sidon Type Inequalities
نویسندگان
چکیده
منابع مشابه
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
We study the non-uniform capacitated multi-item lot-sizing (CMILS) problem. In this problem, there is a set of demands over a planning horizon of T time periods and all demands must be satisfied on time. We can place an order at the beginning of each period s, incurring an ordering cost Ks. The total quantity of all products ordered at time s can not exceed a given capacity Cs. On the other han...
متن کاملOn Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure GreedyAlgorithm and the Orthogonal GreedyAlgorithm in terms of the best m-term approximations. We call such estimates the Lebesgue-type inequalities. We prove the Lebesgue-type inequalities for dictionaries with special structure. We assume t...
متن کاملAn Approximation of the Fourier Sine Transform via Grüss Type Inequalities and Applications for Electrical Circuits
An approximation of the Fourier Sine Transform via Grüss, Chebychev and Lupaş integral inequalities and application for an electrical curcuit containing an inductance L, a condenser of capacity C and a source of electromotive force E0P (t), where P (t) is an L2−integrable function, are given.
متن کاملStrong convergence for variational inequalities and equilibrium problems and representations
We introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition for ...
متن کاملHardy-type Inequalities via Auxiliary Sequences
k=1 |ak|, in which C = (cj,k) and the parameter p are assumed fixed (p > 1), and the estimate is to hold for all complex sequences a. The lp operator norm of C is then defined as the p-th root of the smallest value of the constant U : ||C||p,p = U 1 p . Hardy’s inequality thus asserts that the Cesáro matrix operator C, given by cj,k = 1/j, k ≤ j and 0 otherwise, is bounded on lp and has norm ≤ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1998
ISSN: 0021-9045
DOI: 10.1006/jath.1998.3185